Generalized subgraph-restricted matchings in graphs
نویسندگان
چکیده
منابع مشابه
Generalized subgraph-restricted matchings in graphs
For a graph property P, we define a P-matching as a set M of disjoint edges such that the subgraph induced by the vertices incident to M has property P. Previous examples include strong/induced matchings and uniquely restricted matchings. We explore the general properties of P-matchings, but especially the cases where P is the property of being acyclic or the property of being disconnected. We ...
متن کاملRestricted t-matchings in bipartite graphs
Given a simple bipartite graph G and an integer t ≥ 2, we derive a formula for the maximum number of edges in a subgraph H of G so that H contains no node of degree larger than t and H contains no complete bipartite graph Kt,t as a subgraph. In the special case t = 2 this fomula was proved earlier by Z. Király [6], sharpening a result of D. Hartvigsen [4]. For any integer t ≥ 2, we also determi...
متن کاملRestricted t-matchings in Bipartite Graphs
The results contained in this paper were achieved in 1999, when the author participated the ,,Workshop on Matroids, Matching and Extensions” in Waterloo, Canada. This paper was written and distributed in 2001, when the author gave an EIDMA minicurse in Eindhoven, Netherlands. This is the uncorrected original version, except, that we added an Appendix containing the NP-completeness proof for the...
متن کاملRestricted b-Matchings in Degree-Bounded Graphs
We present a min-max formula and a polynomial time algorithm for a slight generalization of the following problem: in a simple undirected graph in which the degree of each node is at most t+1, nd a maximum t-matching containing no member of a list K of forbidden Kt,t and Kt+1 subgraphs. An analogous problem for bipartite graphs without degree bounds was solved by Makai [15], while the special c...
متن کاملUniquely Restricted Matchings in Interval Graphs
A matching M in a graph G is said to be uniquely restricted if there is no other matching in G that matches the same set of vertices as M . We describe a polynomial-time algorithm to compute a maximum cardinality uniquely restricted matching in an interval graph, thereby answering a question of Golumbic et al. (“Uniquely restricted matchings”, M. C. Golumbic, T. Hirst and M. Lewenstein, Algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.08.027